R-LWE-Based Distributed Key Generation and Threshold Decryption

Ever since the appearance of quantum computers, prime factoring and discrete logarithm-based cryptography have been questioned, giving birth to so-called post-quantum cryptography. The most prominent field in is lattice-based cryptography, protocols that are proved be as difficult break certain hard lattice problems like Learning with Errors (LWE) or Ring (R-LWE). Furthermore, application cryptographic techniques different areas, electronic voting, has also nourished a great interest distributed In this work, we will give two original threshold based problem R-LWE: one for key generation decryption. We prove them both correct secure under assumption hardness some well-known problems. Finally, rough implementation C tentative results about their viability, particular our model generates keys order 103 ms decrypts encrypts 102 ms.